منابع مشابه
Quantum and Post Quantum Cryptography
Public key cryptography is widely used for signing contracts, electronic voting, encryption, and to secure transactions over the Internet. The discovery by Peter Shor, in 1994, of an efficient algorithm based on quantum mechanics for factoring large integers and computing discrete logarithms undermined the security assumptions upon which currently used public key cryptographic algorithms are ba...
متن کامل“ Post - Quantum Cryptography ”
1 Summary of the review In this review I present the book " Post-Quantum Cryptography ". This volume gives a detailed, technical-level treatment of the post-quantum cryptography universe. 2 Summary of the book When (if?) quantum computers of a big enough size will be available, most of the current public-key cryptography primitives based on number theory will be vulnerable. The " next generatio...
متن کاملCryptography from Post-Quantum Assumptions
In this thesis we present our contribution in the field of post-quantum cryptography. We introduce a new notion of weakly Random-Self-Reducible public-key cryptosystem and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum) cryptosystems can be considered as weakly RandomSelf-Reducible. We introduce a new problem called Isometric Lattice P...
متن کاملQuantum Learning Algorithms and Post-Quantum Cryptography
Quantum algorithms have demonstrated promising speed-ups over classical algorithms in the context of computational learning theory despite the presence of noise. In this work, we give an overview of recent quantum speed-ups, revisit the Bernstein-Vazirani algorithm in a new learning problem extension over an arbitrary cyclic group and discuss recent applications in cryptography, such as the Lea...
متن کاملPost - Quantum Cryptography Using Complexity Doctoral
In order to cope with new technologies such as quantum computing and the possibility of developing new algorithms, new cryptosystems should be developed based on a diverse set of unrelated complexity assumptions so that one technique will not break more than a handful of systems. As demonstrated by Shor in 1994, quantum algorithms are known to break traditional cryptosystems based on RSA and Di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2017
ISSN: 0028-0836,1476-4687
DOI: 10.1038/nature23461